一体化联合作战精确控制问题

文中主要对一体化联合作战中的精确控制内涵进行了阐述,然后分别从重要性和实现途径两个方面对作战时序的精确控制、作战空间的精确控制、作战目标的精确控制和作战信息环境的精确控制进行探讨。     

基于模板的军事概念模型描述与设计

首先分析军事概念建模存在的问题,然后提出两个阶段、四个步骤的建模思路,在此基础上通过基于模板的概念模型描述方法,将概念建模区分为实体元模型、动作元模型、关系元模型、属性元模型和数据元模型,通过对上述元模型的建模完成对仿真对象的概念建模。     

基于优化遗传算法的软硬件划分方法

针对软硬件划分问题,研究了一种优化的遗传算法,提出硬件倾向度的概念,用于遗传算法初始群体的生成,减少了初始解的随机性和搜索的盲目性;在遗传算法过程中,使交叉变异概率随着遗传过程由大变小,保证早期具有较大的搜索空间,后期又能保留较好的解,使用动态结束条件自适应结束遗传算法。与对比算法相比,该算法的效率较高,且在大规模问题求解上能够获得更优解。     

双高速摄像机交汇的高旋弹丸位姿估计算法及误差分析

为了测量高旋弹丸在炮口处的各种信息,基于双高速摄像机交汇的测量方法,提出了一种新的弹丸位姿估计方法.对总攻角函数进行了误差建模与分析,结果表明两台高速摄像机的光轴应相互垂直,且应选择光轴远离攻角平面的高速摄像机所对应的测量函数计算总攻角,此时测量误差最小.以靶场实验的方式对攻角函数的误差分析结论和位姿估计算法进行验证....     

基于高斯和-容积Kalman滤波的高轨双星辐射源跟踪

高轨双星系统可通过测量辐射源信号的到达时差、频差和到达高轨卫星的多普勒频移,跟踪沿地球表面巡航且载频固定、已知的运动辐射源。针对辐射源运动方程和观测方程的强非线性,提出了基于高斯和框架与5阶容积Kalman滤波的运动辐射源跟踪算法GS-5CKF。算法将起始时刻的时差观测量所确定的处于地球表面的时差线按辐射源经度等间隔划分,初始化多个并行的5阶容积Kalman滤波器,线性组合各滤波器每个时刻的输出以获得辐射源运动状态的估计。针对5阶容积Kalman滤波器,提出了相应的非线性测度并引入滤波器分裂与合并,以提高跟踪精度并保持GS-5CKF算法计算复杂度基本不变。仿真表明,相对仅使用单个5阶容积Kalman滤波器和基于高斯和框架但使用3阶容积Kalman滤波器的GS-3CKF等算法,提出的跟踪算法具有更高的估计精度。     

War for profit: English corsairs,institutions and decentralised strategy

In this study, we propose that in states with relatively weak central authorities, decision-makers had to develop market-oriented organisation solutions to successfully face a grave external threat, and these solutions proved to be efficient. Using an interdisciplinary approach that combines institutional theory, history and strategy, we analyse a case study, the use of corsairs (privateers) by England in the late sixteenth and early seventeenth centuries. We have found that the development of partnership companies went hand in hand for commercial and military purposes. English privateers proved to be economically efficient and superior to the centrally planned war operations of the Spanish empire.     

Coping with the refugee and migrant crisis in Slovenia: the role of the military

Approximately 470,000 refugees and migrants passed through Slovenian territory between September 2015 and March 2016, creating a crisis that required a great deal of organisational and field work on the part of many governmental and non-governmental institutions. In the social sciences, a discourse on “security versus humanitarian approach” on the refugees and migrant issue appeared; however, the article goes over such a discourse and deals with roles and problems of different institutions – mostly the military – that responded to the crisis. Namely, coping with the crisis was characterised by significant institutional adjustments, difficult co-ordination, and intense public debate. The Slovenian Armed Forces were included in this process as support for Civil Protection and Police. The military’s role followed the military missions defined by the Defence Act; however, the government also proposed some changes to the act that were met with some doubts on the part of the public and different institutions.     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

When Programming Trumps Policy and Plans: The Case of the US Department of the Navy11

Traditionally, policy and planning have been institutionally weak in the Naval Staff (Office of the Chief of Naval Operations – OPNAV). In their place, the N8 (Programming) has dominated resource decision-making, and, by default, decisions relating to policy and planning. Recent uncertainty over defense authorization and appropriations has resulted in calls for a greater role to be played by the N3/5, Policy and Plans Directorate. The article argues that reform of the Department of the Navy’s planning process is urgently needed. OPNAV’s weak planning and overly dominant programming practices are compared with those of the Departments of the Army and Air Force and are shown to be out of conformance with them. The article concludes with specific and detailed recommendations for reform of both the current planning and programming processes.     

基于贝叶斯网络的装备损伤定位系统研究

分析了贝叶斯网络在装备损伤定位方面的优势，及其损伤定位的方法与流程，建立了用于装备损伤定位的贝叶斯网络模型，并开发了损伤定位系统。以某型火炮为例，演示了其损伤定位的一般过程，验证了贝叶斯网络在装备损伤定位中应用的可行性与有效性。